Computational Approach to Anaphora Resolutionin

نویسنده

  • Manuel Palomar
چکیده

This paper presents an algorithm for identifying noun-phrase antecedents of pronouns and adjectival anaphors in Spanish dialogues. We believe that anaphora resolution requires numerous sources of information in order to nd the correct antecedent of the anaphor. These sources can be of diierent kinds, e.g., linguistic information, discourse/dialogue structure information, or topic information. For this reason, our algorithm uses various diierent kinds of information (hybrid information). The algorithm is based on linguistic constraints and preferences and uses an anaphoric accessibility space within which the algorithm nds the noun phrase. We present some experiments related to this algorithm and this space using a corpus of 204 dialogues. The algorithm is implemented in Prolog. According to this study, 95.9% of antecedents were located in the proposed space, a precision of 81.3% was obtained for pronominal anaphora resolution, and 81.5% for adjectival anaphora.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Computational Approach to Zero-pronouns in Spanish

In this paper, a computational approach for resolving zero-pronouns in Spanish texts is proposed. Our approach has been evaluated with partial parsing of the text and the results obtained show that these pronouns can be resolved using similar techniques that those used for pronominal anaphora. Compared to other well-known baselines on pronominal anaphora resolution, the results obtained with ou...

متن کامل

Information Extraction Systems and Nominal Anaphora Analysis Needs

This paper presents the needs for anaphora analysis in Information Extraction from practical point of view. It depicts the problem of anaphora phenomenon and its role in texts together with corpus examples. It encloses a short survey of the computational treatment of nominal anaphora. In the end, a uniform approach for nominal anaphora analysis is proposed. Moreover, the paper describes require...

متن کامل

A Computational Approach to Pronominal Anaphora, One- Anaphora and Surface Count Anaphora

This paper is the continuation of Ferrández [5][4] in which we have developed a computational system in Prolog (Slot Unification Parser or SUP) that includes a new grammatical formalism (Slot Unification Grammar or SUG). In this work, we are going to deal with several kinds of anaphora both in restricted and unrestricted texts: pronominal anaphora, surface count anaphora and one-anaphora. We on...

متن کامل

Bilingual Pronoun Resolution: Experiments in English and French

Anaphora resolution has been a subject of research in computational linguistics for more than 25 years. The interest it aroused was due to the importance that anaphoric phenomena play in the coherence and cohesiveness of natural language. A deep understanding of a text is impossible without knowledge about how individual concepts relate to each other; a shallow understanding of a text is often ...

متن کامل

A Data-driven Approach to Pronominal Anaphora Resolution for German

This paper reports on a hybrid architecture for computational anaphora resolution (CAR) of German that combines a rule-based pre-filtering component with a memory-based resolution module (using the Tilburg Memory Based Learner – TiMBL). The data source is provided by the TüBa-D/Z treebank of German newspaper text (Telljohann et al. 04) that is annotated with anaphoric relations. The CAR experim...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007